On rewrite programs: Semantics and relationship with prolog
نویسندگان
چکیده
منابع مشابه
On Rewrite Programs: Semantics and Relationship with Prolog
Rewrite programs are logic programs represented as rewrite rules, whose execution mechanism usually employs some version of Knuth-Bendix type completion. Rewrite programs allow one to express mutually exclusively defined predicates as well as those which are not. In this paper we demonstrate that rewrite programs, although denotationally equivalent to Prolog on the ground level, may produce few...
متن کاملSemantics for Prolog via Term Rewrite Systems
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملOperational and Denotational Semantics of Rewrite Programs
In this paper we present a new operational and denotational semantics for rewrite systems as logic programs. The main feature of our rewrite programs is that they allow us to define predicates not only by implications as in Prolog, but also by equivalences. We give a few examples showing how rewrite programs may turn out to be more effective than Prolog programs in capturing the user’s intended...
متن کاملOracle Semantics for Prolog
This paper proposes to specify semantic de nitions for logic programming languages such as Prolog in terms of an oracle which speci es the control strategy and identi es which clauses are to be applied to resolve a given goal. The approach is quite general. It is applicable to Prolog to specify both operational and declarative semantics as well as other logic programming languages. Previous sem...
متن کاملResultants Semantics for Prolog
In this paper we study some rst order formulas, called resultants, which can be used to describe in a concise way most of the relevant information associated to SLD-derivations. We rst extend to resultants some classical results of logic programming theory. Then we deene a xpoint semantics for Prolog computed resultants, i.e. those formulas which are obtained by considering the leftmost selecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1992
ISSN: 0743-1066
DOI: 10.1016/0743-1066(92)90050-d